WORST_CASE(?,O(n^1))

Solution:
---------

  "+" :: ["A"(1) x "A"(1)] -(1)-> "A"(0)
  "0" :: [] -(0)-> "A"(2)
  "0" :: [] -(0)-> "A"(1)
  "false" :: [] -(0)-> "A"(0)
  "not" :: ["A"(0)] -(1)-> "A"(0)
  "odd" :: ["A"(2)] -(1)-> "A"(0)
  "s" :: ["A"(2)] -(2)-> "A"(2)
  "s" :: ["A"(1)] -(1)-> "A"(1)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "true" :: [] -(0)-> "A"(0)


Cost Free Signatures:
---------------------

  "+" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "0" :: [] -(0)-> "A"_cf(0)
  "false" :: [] -(0)-> "A"_cf(0)
  "not" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "odd" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "true" :: [] -(0)-> "A"_cf(0)


Base Constructors:
------------------